Processing Rank-Aware Queries in P2P Systems
نویسندگان
چکیده
Efficient query processing in P2P systems poses a variety of challenges. As a special problem in this context we consider the evaluation of rank-aware queries, namely top-N and skyline, on structured data. The optimization of query processing in a distributed manner at each peer requires locally available statistics. In this paper, we address this problem by presenting approaches relying on the R-tree and histogram-based index structures. We show how this allows for optimizing rank-aware queries even over multiple attributes and thus significantly enhances the efficiency of query processing.
منابع مشابه
Processing rank aware queries in schema based P2P systems
In recent years, there has been considerable research with respect to query processing in data integration and P2P systems. Conventional data integration systems consist of multiple sources with possibly different schemas, adhere to a hierarchical structure, and have a central component (mediator) that manages a global schema. Queries are formulated against this global schema and the mediator p...
متن کاملDiploma Thesis: Skyline Queries in P2P Systems by Daniel Zinn
Schema-based Peer-to-Peer (P2P) systems are a federation of peers, in which each peer controls its own data and database schema. In order to retrieve a few data items within a very large structured data set, rank-aware queries are utilized, namely top-N and skyline, for optimizing single respectively multiple criteria. The goal of this thesis is to develop an efficient approach for computing th...
متن کاملTraitement de Requêtes Top-k dans les Communautés Virtuelles P2P de Partage de Données. (Top-k Query Processing in P2P Data Sharing Virtual Communities)
Top-k queries have two main advantages for peer-to-peer (P2P) data sharing virtual communities. First, they allow participants to rank the results for their queries based on the existing data in the system as well as on their own preferences. Second, they avoid overwhelming participants with too many results. However, existing top-k query processing techniques for P2P systems make users suffer ...
متن کاملRank-aware, Approximate Query Processing on the Semantic Web
The amount of data on the WWW that adheres to Semantic Web standards is rapidly increasing. Search over this huge Web data corpus frequently leads to queries having large result sets. So, in order to discover data elements, which satisfy a given information need, users must rely on ranking techniques to sort results according to their relevance. Unfortunately, processing queries with ranked res...
متن کاملProcessing Skyline Queries in P2P Systems
Efficient query processing in P2P systems poses a variety of challenges mainly resulting from the strict decentralization and limited knowledge. Particularly with regard to queries involving ranking, top-N or skylines, existing approaches for centralized systems cannot be applied easily to P2P environments. In this paper, we focus on the problem of efficiently processing skyline queries in larg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005